#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e3+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],b[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL m,n;cin>>m>>n;
   if(n<m){
      LL sum=0;
      for(LL i=1;i<=m;i++){
         cout<<i<<" ";
         sum+=i;
      }
      for(LL i=1;i<n;i++){
         cout<<-i<<" ";
         sum-=i;
      }
      cout<<-sum<<"\n";
   }
   else{
      LL sum=0;
      for(LL i=1;i<=n;i++){
          cout<<"-"<<i<<" ";
          sum+=-1*i;
      }
      for(LL i=1;i<m;i++){
          cout<<i<<" ";
          sum+=i;
      }
      cout<<-sum<<"\n";
   }
   return 0;
}
